On concentration of self-bounding functions
نویسندگان
چکیده
We prove some new concentration inequalities for self-bounding functions using the entropy method. As an application, we recover Talagrand’s convex distance inequality. The new Bernstein-like inequalities for self-bounding functions are derived thanks to a careful analysis of the so-called Herbst argument. The latter involves comparison results between solutions of differential inequalities that may be interesting in their own right. ∗Supported by anr grant tamis †Supported by the Spanish Ministry of Science and Technology grant MTM2006-05650. and by the PASCAL Network of Excellence under EC grant no. 506778.
منابع مشابه
Nearly Tight Bounds on ℓ1 Approximation of Self-Bounding Functions
We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube {0, 1}. Informally, a function f : {0, 1} → R is self-bounding if for every x ∈ {0, 1}, f(x) upper bounds the sum of all the n marginal decreases in the value of the function at x. Self-bounding functions include such well-known classes of functions as submodul...
متن کاملNearly Tight Bounds on $\ell_1$ Approximation of Self-Bounding Functions
We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube {0, 1}n. Informally, a function f : {0, 1}n → R is self-bounding if for every x ∈ {0, 1}n, f(x) upper bounds the sum of all the n marginal decreases in the value of the function at x. Self-bounding functions include such well-known classes of functions as submo...
متن کاملA note on concentration of submodular functions
We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding functions. The power of these concentration bounds is that they are dimension-free, in particular implying standard deviation O( √ E[f ]) rather than O( √ n) which can be obtained for any 1Lipschitz function of n variab...
متن کاملConcentration for self-bounding functions and an inequality of Talagrand
We see that the entropy method yields strong concentration results for general selfbounding functions of independent random variables. These give an improvement of a concentration result of Talagrand much used in discrete mathematics. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 29, 549–557, 2006
متن کاملEntropy-Based Concentration Inequalities for Dependent Variables
We provide new concentration inequalities for functions of dependent variables. The work extends that of Janson (2004), which proposes concentration inequalities using a combination of the Laplace transform and the idea of fractional graph coloring, as well as many works that derive concentration inequalities using the entropy method (see, e.g., (Boucheron et al., 2003)). We give inequalities f...
متن کامل